A Mechanization of Strong Kleene Logic for Partial Functions
نویسندگان
چکیده
Even though it is not very often admitted, partial functions do play a significant role in many practical applications of deduction systems. Kleene has already given a semantic account of partial functions using three-valued logic decades ago, but there has not been a satisfactory mechanization. Recent years have seen a thorough investigation of the framework of many-valued truth-functional logics. However, strong Kleene logic, where quantification is restricted and therefore not truthfunctional, does not fit the framework directly. We solve this problem by applying recent methods from sorted logics. This paper presents a resolution calculus that combines the proper treatment of partial functions with the efficiency of sorted calculi.
منابع مشابه
A Tableau Calculus for Partial Functions ?
Even though it is not very often admitted, partial functions do play a signiicant role in many practical applications of deduction systems. Kleene has already given a semantic account of partial functions using a three-valued logic decades ago, but there has not been a satisfactory mechanization. Recent years have seen a thorough investigation of the framework of many-valued truth-functional lo...
متن کاملTheorem Proving for Classical Logic with Partial Functions by Reduction to Geometric Kleene Logic
Partial functions are abundant in mathematics and program specifications. Unfortunately, their importance has been mostly ignored in automated theorem proving. In this paper, we develop a theorem proving strategy for Partial Classical Logic (PCL). Proof search takes place in Kleene Logic. We show that PCL theories can be translated into sets of formulas in Kleene logic. For proof search in Klee...
متن کاملTheorem proving for classical logic with partial functions by reduction to Kleene logic
Partial functions are abundant in mathematics and program specifications. Unfortunately, their importance has been mostly ignored in automated theorem proving. In this paper, we develop a theorem proving strategy for Partial Classical Logic (PCL). Proof search takes place in Kleene Logic. We show that PCL theories can be translated into equivalent sets of formulas in Kleene logic. For proof sea...
متن کاملFrançois Lepage PARTIAL PROBABILITY FUNCTIONS AND INTUITIONISTIC LOGIC
We first present a sound and complete system of intuitionistic logic augmented with Nelson’s strong negation and interpreted in Kripke’s models’ structure. Then, we show that intuitionistic logic can naturally be interpreted in a modal trivalent logic (propositions are true, false or undefined). Secondly, we introduce a partial probability interpretation, which is inspired by Popper’s condition...
متن کاملProgram Construction and Verification Components Based on Kleene Algebra
Variants of Kleene algebra support program construction and verification by algebraic reasoning. This entry provides a verification component for Hoare logic based on Kleene algebra with tests, verification components for weakest preconditions and strongest postconditions based on Kleene algebra with domain and a component for step-wise refinement based on refinement Kleene algebra with tests. ...
متن کامل